Multiparty communication complexity

Results: 14



#Item
11A Communication Lower Bounds Using Directional Derivatives ALEXANDER A. SHERSTOV, University of California, Los Angeles We study the set disjointness problem in the most powerful model of bounded-error communication, the

A Communication Lower Bounds Using Directional Derivatives ALEXANDER A. SHERSTOV, University of California, Los Angeles We study the set disjointness problem in the most powerful model of bounded-error communication, the

Add to Reading List

Source URL: www.cs.ucla.edu

Language: English - Date: 2014-06-25 14:31:55
12Multiparty Computation for Interval, Equality, and Comparison without Bit-Decomposition Protocol Takashi Nishide1,2 and Kazuo Ohta1 1

Multiparty Computation for Interval, Equality, and Comparison without Bit-Decomposition Protocol Takashi Nishide1,2 and Kazuo Ohta1 1

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2009-07-17 02:37:29
13[removed]The Hales–Jewett Theorem[removed]Many players: the matrix product problem One of the highest known lower

[removed]The Hales–Jewett Theorem[removed]Many players: the matrix product problem One of the highest known lower

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2007-08-30 03:42:26
    14Cell-Probe Lower Bounds for the Partial Match Problem T.S. Jayram∗ Subhash Khot† Ravi Kumar∗

    Cell-Probe Lower Bounds for the Partial Match Problem T.S. Jayram∗ Subhash Khot† Ravi Kumar∗

    Add to Reading List

    Source URL: www.cs.technion.ac.il

    Language: English - Date: 2007-04-01 08:28:26